97 research outputs found

    The Cagliari Airport impact on Sardinia tourism: a Logit-based analysis

    Get PDF
    In the field of air transportation management, traditionally, airlines have been the main actors in the process for deciding which new flights open in a given airport, while airports acted only as the managers of the operations. The changes in the market due to the introduction of low cost companies, with consequent reduction of the airports' fares, as well as the increment of the density of regional airports in several European countries are modifying the mutual roles of airlines and airports. The final decision on new flight to be opened, in fact, is nowadays the result of a negotiation between airlines and airports. The airports must prove the sustainability on the new routes and forecast the economic impact on their catchment area. This paper contributes to advance the current state-of-the-art along two axes. From the pure transportation literature point of view, we introduce a Logit model able to predict the passengers flow in an airport when the management introduces a change in the flight schedule. The model is also able to predict the impact of this change on the airports in the surrounding areas. The second contribution is a case study on the tourist market of the Sardinia region, where we show how to use the results of the model to deduce the economic impact of the decisions of the management of the Cagliari airport on its catchment area in terms of tourists and economic growt

    City Logistics

    Get PDF

    The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities

    Get PDF
    We consider a decision maker who performs a stochastic decision process over a multiple number of stages, where the choice alternatives are characterized by random utilities with unknown probability distribution. The decisions are nested each other, i.e. the decision taken at each stage is affected by the subsequent stage decisions. The problem consists in maximizing the total expected utility of the overall multi-stage stochastic dynamic decision process. By means of some results of the extreme values theory, the probability distribution of the total maximum utility is derived and its expected value is found. This value is proportional to the logarithm of the accessibility of the decision maker to the overall set of alternatives in the different stages at the start of the decision process. It is also shown that the choice probability to select alternatives becomes a Nested Multinomial Logit model

    The multi-path Traveling Salesman Problem with stochastic travel costs

    Get PDF
    Given a set of nodes, where each pair of nodes is connected by several paths and each path shows a stochastic travel cost with unknown probability distribution, the multi-path Traveling Salesman Problem with stochastic travel costs aims at finding an expected minimum Hamiltonian tour connecting all nodes. Under a mild assumption on the unknown probability distribution, a deterministic approximation of the stochastic problem is given. The comparison of such approximation with a Monte Carlo simulation shows both the accuracy and the efficiency of the deterministic approximation, with a mean percentage gap around 2% and a reduction of the computational times of two orders of magnitude

    Multi-start heuristics for the Two-Echelon Vehicle Routing Problem

    Get PDF
    In this paper we address the Two-Echelon Vehicle Routing Problem (2E-VRP), an extension of the classical Capacitated VRP, where the delivery from a single depot to the customers is managed by routing and consolidating the freight through intermediate depots called satellites. We present a family of Multi-Start heuristics based on separating the depot-to-satellite transfer and the satellite-to-customer delivery by iteratively solving the two resulting routing subproblems, while adjusting the satellite workloads that link them. The common scheme on which all the heuristics are based consists in, after having found an initial solution, applying a local search phase, followed by a diversification; if the new obtained solutions are feasible, then local search is applied again, otherwise a feasibility search procedure is applied, and if it successful, the local search is applied on the newfound solution. Different diversification strategies and feasibility search rules are proposed. We present computational results on a wide set of instances up to 50 customers and 5 satellites and compare them with results from the literature, showing how the new methods outperform previous existent methods, both in efficiency and accurac

    The two-echelon capacitated vehicle routing problem: models and math-based heuristics

    Get PDF
    Multiechelon distribution systems are quite common in supply-chain and logistics. They are used by public administrations in their transportation and traffic planning strategies, as well as by companies, to model own distribution systems. In the literature, most of the studies address issues relating to the movement of flows throughout the system from their origins to their final destinations. Another recent trend is to focus on the management of the vehicle fleets required to provide transportation among different echelons. The aim of this paper is twofold. First, it introduces the family of two-echelon vehicle routing problems (VRPs), a term that broadly covers such settings, where the delivery from one or more depots to customers is managed by routing and consolidating freight through intermediate depots. Second, it considers in detail the basic version of two-echelon VRPs, the two-echelon capacitated VRP, which is an extension of the classical VRP in which the delivery is compulsorily delivered through intermediate depots, named satellites. A mathematical model for two-echelon capacitated VRP, some valid inequalities, and two math-heuristics based on the model are presented. Computational results of up to 50 customers and four satellites show the effectiveness of the methods developed

    A DSS for business decisions in air transportation: a case study

    Get PDF
    The socio-economic development leads people to a great mobility. Thus the flights identification and management is becoming a key factor for the economic growth of the areas nearby the airports. The airport management is constantly looking for methods to improve its performance, both in terms of profitability and quality of service and the proper planning of passenger flows. To address these issues, scientific research provides methods and tools for decision support at all planning levels (i.e., strategic, tactical, operational, real time). In recent literature, it is now widely recognized that the hybridization of simulation and optimization systems is a very reliable technique for such decisions. This work intends to present an efficient Decision Support System framework based on the hybridization of a discrete event simulator and a Logit model. In order to show the effectiveness of the framework, we show the results of a real case study in North Ital

    A Reactive GRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem

    Get PDF
    We propose a meta-heuristic based on GRASP combined with Path Relinking to address the Two-Echelon Vehicle Routing Problem, an extension of the Capacitated Vehicle Routing Problem in which the delivery from a single depot to customers is achieved by routing and consolidating the freight through intermediate depots called satellites. The problem is treated by separating the depot-to-satellite transfer and the satellite-to-customer delivery, and iteratively solving the two resulting routing subproblems, while adjusting the satellite workloads that link them. The meta-heuristic scheme consists of applying a GRASP and a local search procedures in sequence. Then, the resulting solution is linked to an elite solution by means of a Path Relinking procedure. To escape from infeasible solutions, which are quite common in this kind of problem, a feasibility search procedure is applied within Path Relinking. Extensive computational results on instances with up to 50 customers and 5 satellites show that the meta-heuristic is able to improve literature results, both in efficiency and accurac
    corecore